#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <vector>

using namespace std;
using LL = long long;
const int mod = 1e9 + 7;
const int N = 1e6 + 10;

int n;
int prime[N], cnt;
bool st[N];
int s[N];

void init(){
    for(int i = 2; i <= n; i ++){
        if(!st[i]){
            prime[cnt ++] = i;
        }
        for(int j = 0; prime[j] <= n / i; j ++){
            st[prime[j] * i] =  true;
            if(i % prime[j] == 0) break;
        }
        
    }
}

int main(){
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n;
    init();
    LL res = 1;
    for(int i = 0; i < cnt; i ++){
        int s = 0;
        int p = prime[i];
        for(int j = n; j; j /= p){
            s += j/p;
        }

        res = res * ((LL)s * 2 % mod + 1) % mod;
    }

    cout << res << '\n';

    return 0;
}